Constant-space string-matching in sublinear average time
نویسندگان
چکیده
منابع مشابه
Constant-Space String-Matching in Sublinear Average Time
Given two strings: pattern P of lengthm and text T of length n. The stringmatching problem is to nd all occurrences of the pattern P in the text T . We present a simple string-matching algorithms which works in average o(n) time with constant additional space for one-dimensional texts and two-dimensional arrays. This is the rst attempt to the small-space string-matching problem in which subline...
متن کاملReal-Time String Matching in Sublinear Space
We study a problem of efficient utilisation of extra memory space in real-time string matching. We propose, for any constant " > 0, a real-time string matching algorithm claiming O(m") extra space, where m is the size of a pattern. All previously known real-time string matching algorithms use (m) extra
متن کاملSimple Real-Time Constant-Space String Matching
We use a simple observation about the locations of critical factorizations to derive a real-time variation of the Crochemore-Perrin constant-space string matching algorithm. The real-time variation has a simple and efficient control structure.
متن کاملApproximate String Matching in Sublinear Expected Time
The k differences approximate string matching problem specifies a text string of length n, a pattern string of length m, the number k of differences (insertions, deletions, substitutions) allowed in a match, and asks for every location in the text where a match occurs. Previous algorithms require at least O(nk) time. When k is as large as a fraction of m, no substantial progress has been made o...
متن کاملSublinear Approximate String Matching
The present paper deals with the subject of approximate string matching and demonstrates how Chang and Lawler [CL94] conceived a new sublinear time algorithm out of ideas that had previously been known. The problem is to find all locations in a text of length n over a b-letter alphabet where a pattern of length m occurs with up to k differences (substitutions, insertions, deletions). The algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00259-x